Перевод: с английского на русский

с русского на английский

finite chain

Страницы

См. также в других словарях:

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

  • Chain complex — Bicomplex redirects here. For the number, see Bicomplex number In mathematics, chain complex and cochain complex are constructs originally used in the field of algebraic topology. They are algebraic means of representing the relationships between …   Wikipedia

  • Finite projective geometry — In mathematics, a finite projective space S is a set P (the set of points), together with a set of subsets of P (the set of lines), all of which have at least three elements, satisfying these axioms : * Each two distinct points p and q are in… …   Wikipedia

  • Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

  • Subshift of finite type — In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state… …   Wikipedia

  • Regular chain — In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular… …   Wikipedia

  • Ascending chain condition — The ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly, ideals in certain commutative rings.[1][2][3] These conditions played an important role… …   Wikipedia

  • Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… …   Wikipedia

  • Steiner chain — In geometry, a Steiner chain is a set of n circles, all of which are tangent to two given non intersecting circles (blue and red in Figure 1), where n is finite and each circle in the chain is tangent to the previous and next circles in the chain …   Wikipedia

  • Critical Chain Project Management — (CCPM) is a method of planning and managing projects that puts more emphasis on the resources required to execute project tasks developed by Eliyahu M. Goldratt. This is in contrast to the more traditional Critical Path and PERT methods, which… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»